Reducing the Depth of Linear Reversible Quantum Circuits

In quantum computing the decoherence time of qubits determines computation available and this is very limited when using current hardware. paper we minimize execution (the depth) for a class circuits referred to as linear reversible circuits, which has many applications in (e.g., stabilizer CNOT+T etc.). We propose practical formulation divide conquer algorithm that produces are twice shallow those produced by existing algorithms. improve theoretical upper bound depth worst case some range qubits. also greedy algorithms based on cost minimization find more optimal small or simple operators. Overall, manage consistently reduce total functions, with up 92% savings an ancilla-free 99% ancillary available.